例句與造句

1. The branch table can be saved on flash memory.
2. Thus, a branch table is maintained to save the subsequent LBA information of all branch nodes.
3. However, procedural programming relies heavily on non-structured imperative languages use goto statements and branch tables for the same purpose.
4. At the 1906 Annual Conference Bexley branch tabled a motion calling on the party to adopt a policy of socialist industrial unionism.
5. The decoding of single byte opcodes can be very simply and efficiently handled by a branch table using the opcode directly as an index.
6. It's difficult to find branch table in a sentence. 用branch table造句挺難的
7. Additionally, an optimized implementation may execute much faster than the alternative, because it is often implemented by using an indexed branch table.
8. The starting entry address of the branch table that corresponds to a branch node can be saved at the spare area of the corresponding page.
9. Assembly language programmers ( including optimizing compiler writers ) are also able to benefit from the technique of dynamic loop unrolling, using a method similar to that used for efficient branch tables.
10. Programmers frequently leave the decision of whether or not to create a branch table to the compiler, believing that it is perfectly capable of making the correct choice from the known search keys.
11. While the technique is now known as'branch tables', early compiler users called the implementation'computed GoTo', referring to the instruction found in the Fortran series of compilers.
12. Control tables containing only the offsets to the program labels can be constructed to overcome this redundancy ( at least in assembly languages ) and yet requiring only minor execution time overhead compared to a conventional branch table.
13. In the IBM System / 360, where a return code was expected from the subroutine, the return value was often designed to be a multiple of 4 so that it could be used as a direct branch table index into a branch table often located immediately after the call instruction to avoid extra conditional tests, further improving efficiency.
14. In the IBM System / 360, where a return code was expected from the subroutine, the return value was often designed to be a multiple of 4 so that it could be used as a direct branch table index into a branch table often located immediately after the call instruction to avoid extra conditional tests, further improving efficiency.
15. Where there is no obvious integer value available for a branch table it can nevertheless be created from a search key ( or part of a search key ) by some form of arithmetic transformation, or could simply be the row number of a database or the entry number in an array containing the search key found during earlier validation of the key.
16. However, compilers are not as intelligent as humans and cannot have a deep knowledge of'context', believing that a range of possible search key integer values such as 1, 2, 4, 6, 7, 20, 23, 40, 42, 50 & 1000 would generate a branch table with an excessively large number of empty entries ( 900 + ) for very little advantage . ( A good optimizing compiler may then presort the values and generate code for a binary chop search, as a'second best'option . ) In fact, the application may be highly " time critical " and memory requirement may not really be an issue at all.